GPU accelerated computation of fast spectral transforms
نویسندگان
چکیده
منابع مشابه
GPU accelerated convex hull computation
We present a hybrid algorithm to compute the convex hull of points in three or higher dimensional spaces. Our formulation uses a GPU-based interior point filter to cull away many of the points that do not lie on the boundary. The convex hull of remaining points is computed on a CPU. The GPU-based filter proceeds in an incremental manner and computes a pseudo-hull that is contained inside the co...
متن کاملGPU-accelerated computation of electron transfer
Electron transfer is a fundamental process that can be studied with the help of computer simulation. The underlying quantum mechanical description renders the problem a computationally intensive application. In this study, we probe the graphics processing unit (GPU) for suitability to this type of problem. Time-critical components are identified via profiling of an existing implementation and s...
متن کاملFast Computation of Partial Fourier Transforms
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to decompose the summation domain of into simpler components in a multiscale way. Existing fast algorithms are then applied to each component to obtain optimal compl...
متن کاملGPU-Accelerated Computation and Interactive Display of Molecular Orbitals
In this chapter, we present several GPU algorithms for evaluating molecular orbitals on three-dimensional lattices, as is commonly used for molecular visualization. For each kernel, we describe necessary design trade-offs, applicability to various problem sizes, and performance on different generations of GPU hardware. Further, we demonstrate the appropriate and effective use of fast on-chip GP...
متن کاملGPU Accelerated Computation and Visualization of Hexagonal Cellular Automata
We propose a graphics processor unit (GPU)-accelerated method for real-time computing and rendering cellular automata (CA) that is applied to hexagonal grids. Based on our previous work [9] –which introduced first and second dimensional cases– this paper presents a model for hexagonal grid algorithms. Proposed method is novel and it encodes and transmits large CA key-codes to the graphics card ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Facta universitatis - series: Electronics and Energetics
سال: 2011
ISSN: 0353-3670,2217-5997
DOI: 10.2298/fuee1103483g